Pivot selection: Dimension reduction for distance-based indexing
نویسندگان
چکیده
Article history: Available online 29 October 2011
منابع مشابه
Pivot Selection Methods Based on Covariance and Correlation for Metric-space Indexing
Metric-space indexing is a general method for similarity queries of complex data. The quality of the index tree is a critical factor of the query performance. Bulkloading a metricspace indexing tree can be represented by two recursive steps, pivot selection and data partition, while pivot selection dominants the quality of the index tree. Two heuristics, based on covariance and correlation, for...
متن کاملReduction of Distance Computations in Selection of Pivot Elements for Balanced GHT Structure
For objects in general metric spaces, the generalized hyperplane indexing is one of the most widely used indexing techniques In the paper, some methods are presented to improve the quality of the partitioning in generalized hyperplane tree structure from the viewpoint of balancing factor. The proposed method to represent the elements in the target domain metric space is the usage of a distance ...
متن کاملAdaptative and Dynamic Pivot Selection for Similarity Search
In this paper, a new indexing and similarity search method based on dynamic selection of pivots is presented. It uses Sparse Spatial Selection (SSS) for the initial selection of pivots. In order to the index suits itself to searches, we propose two new selection policies of pivots. The proposed structure automatically adjusts to the region where most of searches are made. In this way, the amoun...
متن کاملCurse of Dimensionality in the Application of Pivot-based Indexes to the Similarity Search Problem
In this work we study the validity of the so-called curse of dimensionality for indexing of databases for similarity search. We perform an asymptotic analysis, with a test model based on a sequence of metric spaces (Ωd) from which we pick datasets Xd in an i.i.d. fashion. We call the subscript d the dimension of the space Ωd (e.g. for R d the dimension is just the usual one) and we allow the si...
متن کاملA comparison of pivot selection techniques for permutation-based indexing
Recently, permutation based indexes have attracted interest in the area of similarity search. The basic idea of permutation based indexes is that data objects are represented as appropriately generated permutations of a set of pivots (or reference objects). Similarity queries are executed by searching for data objects whose permutation representation is similar to that of the query, following t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 13 شماره
صفحات -
تاریخ انتشار 2012